Automaticity of Double Sequences Generated by One-Dimensional Linear Cellular Automata
نویسندگان
چکیده
We give a complete answer to the question whether a double sequence that is generated by a one-dimensional linear cellular automaton, and whose states are integers modulo m, is k-automatic or not.
منابع مشابه
Schur congruences, Carlitz sequences of polynomials and automaticity
We rst generalize the Schur congruence for Legendre polynomials to sequences of polyno-mials that we call \d-Carlitz". This notion is more general than a similar notion introduced by Carlitz. Then, we study automaticity properties of double sequences generated by these sequences of polynomials, thus generalizing previous results on double sequences produced by one-dimensional linear cellular au...
متن کاملStream cipher using two dimensional Cellular Automata
The pseudo-random early in cryptography systems, the important of cellular automata has properties which are considered a state machine, high periods. two–dimensional cellular automata was used to avoid the limitation of the generated periods in the pseudo-random binary sequences such that used in linear shift Feedback registers (LFSR) , the binary sequences that are generated form CA generator...
متن کاملEdge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کاملOn the Quantitative Behavior of the Linear Cellular Automata
In this paper, we study the quantitative behavior of one-dimensional linear cellular automata Tf [−r,r], defined by local rule f(x−r, . . . , xr) = r ∑ i=−r λixi (mod m), acting on the space of all doubly infinite sequences with values in a finite ring Zm, m ≥ 2. Once generalize the formulas given by Ban et al. [J. Cellular Automata 6 (2011) 385-397] for measure-theoretic entropy and topologica...
متن کاملSearching for efficient cellular automata based keys applied in symmetric key cryptography
In this paper we consider a problem of generation by cellular automata of high quality pseudorandom sequences useful in cryptography. For this purpose one dimensional nonuniform cellular automata is used. The quality of pseudorandom sequences generated by cellular automata depends on collective behavior of rules assigned to the cellular automata cells. Genetic algorithm is used to find suitable...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 188 شماره
صفحات -
تاریخ انتشار 1997